1306. Jump Game III - LeetCode Solution

class Solution:
    def canReach(self, arr: List[int], start: int) -> bool:
        visited = {}
        
        def trav(point):
            if point in visited:
                return False
            if point <0:
                return False
            if point > len(arr)-1:
                return False
            
            visited[point] = True
            if arr[point] == 0:
                return True
            
            return trav(point+arr[point]) or trav(point -  arr[point])
        return trav(start)